The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability
نویسندگان
چکیده
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integrality gap of the LP relaxation of Wood’s [19] integer program is not bounded by a constant factor, even when the LP relaxation is strengthened by our valid inequalities. Finally, we provide an approximation-factor-preserving reduction from the simpler R-Interdiction Covering Problem to MFNIP.
منابع مشابه
A Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملUsing Sensors to Interdict Nuclear Material Smuggling
We describe a stochastic network interdiction model for locating sensors that detect nuclear material. A nuclear material smuggler selects a path through a transportation network that maximizes the probability of avoiding detection. An interdictor installs sensors to minimize that maximum probability. We formulate this problem as a bi-level stochastic mixed-integer program, and then focus on a ...
متن کاملOn bounded pitch inequalities for the min-knapsack polytope
In the min-knapsack problem one aims at choosing a set of objects with minimum total cost and total profit above a given threshold. In this paper, we study a class of valid inequalities for min-knapsack known as bounded pitch inequalities, which generalize the well-known unweighted cover inequalities. While separating over pitch-1 inequalities is NPhard, we show that approximate separation over...
متن کاملReduction of Maximum Flow Network Interdiction Problem: Step towards the Polynomial Time Solutions
In the present work an attempt is being made to reduce the Maximum Flow Network Interdiction Problem (MFNIP) in to the Subset Sum Problem so as to get some algorithms solvable in polynomial time. Previously developed algorithms are either applicable to some special cases of MFNIP or they do not have a constant performance guarantee. Our reduction has paved the way towards the development of ful...
متن کاملIntegrality Gaps for Strong SDP Relaxations of U G
With the work of Khot and Vishnoi [18] as a starting point, we obtain integrality gaps for certain strong SDP relaxations of U G. Specifically, we exhibit a U G gap instance for the basic semidefinite program strengthened by all valid linear inequalities on the inner products of up to exp(Ω(log log n)1/4) vectors. For a stronger relaxation obtained from the basic semidefinite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 38 شماره
صفحات -
تاریخ انتشار 2010